program semantics

On Program Semantics of Dynamic Data Structures

论动态数据结构的程序语义

The partial weakest precondition is another way to represent the over-approximated program semantics, and its definition is also based on variable abstraction.

部分最弱前置条件是程序保守近似语义的另一种表示方法，同样基于变量抽象定义。

Programs have appeared as O_expressions ( expressions of operations on physical objects) and program semantics are given by axioms on O_expressions.

程序以操作表达式的形式呈现，而其语义则以公理的形式给出。

So, this paper addresses how to define program semantics on dynamic data structures.

本文针对这种情况，研究了如何正确刻划动态数据结构的程序语义问题。

We then present the partial strongest post-condition, which represents the over-approximated program semantics.

基于变量抽象，我们定义了部分最强后置条件，进而定义了程序的保守近似语义。